Uniform multicommodity flow through the complete graph with random edge-capacities
نویسندگان
چکیده
منابع مشابه
Uniform multicommodity flow through the complete graph with random edge-capacities
Give random capacities C to the edges of the complete n-vertex graph. Consider the maximum flow Φn that can be simultaneously routed between each source-destination pair. We prove that Φn → φ in probability where the limit constant φ depends on the distribution of C in a simple way, and that asymptotically one need use only oneand two-step routes. The proof uses a reduction to a random graph pr...
متن کاملOptimal Multicommodity Flow through the Complete Graph with Random Edge-capacities
We consider a multicommodity flow problem on a complete graph with the edges having random i.i.d capacities. We show that as the number of nodes tends to infinity, the maximum utility, given by the average of a concave function of each commodity flow, has an almost sure limit. Further, the asymptotically optimal flow uses only direct and two-hop paths, and can be obtained in a distributed manner.
متن کاملUniform multicommodity flow in the hypercube with random edge capacities
We give two results for multicommodity flows in the d-dimensional hypercube Qd with independent random edge-capacities distributed like a random variable C where P[C > 0] > 1/2. Firstly, with high probability as d → ∞, the network can support simultaneous multicommodity flows of volume close to E[C] between all antipodal vertex pairs. Secondly, with high probability, the network can support sim...
متن کاملUniform multicommodity flows in the hypercube with random edge-capacities
We give two results for multicommodity flows in the d-dimensional hypercube Qd with independent random edge capacities distributed like C where P[C > 0] > 1/2. Firstly, with high probability as d → ∞, the network can support simultaneous multicommodity flows of volume close to E[C] between all antipodal vertex pairs. Secondly, with high probability, the network can support simultaneous multicom...
متن کاملSingle-commodity network design with random edge capacities
This paper examines the single-commodity network design problem with stochastic edge capacities. We characterize the structures of the optimal designs and compare with the deterministic counterparts. We do this partly to understand what constitutes robust network designs, but also to construct a heuristic for the stochastic problem, leading to optimality gaps of about 10%. In our view, that is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2009
ISSN: 0167-6377
DOI: 10.1016/j.orl.2009.04.008